Rewriting the Conditions in Conditional Rewriting
نویسنده
چکیده
Category theory has been used to provide a semantics for term rewriting systems at an intermediate level of abstraction between the actual syntax and the relational model. Recently we have developed a semantics for TRSs using monads which generalises the equivalnece between algebraic theories and nitary monads on the category Sets. This semantics underpins the recent categorical proofs of state-of-the-art results in modular rewriting. We believe that our methods can be applied to modularity for conditional rewriting where several open problems exist. Any results we achieve here would be highly signiicant as, for the rst time, substantial open problems in rewriting would have been solved using categorical techniques. This paper reports on the rst step in this project, namely the construction of a semantics for CTRS using monads.
منابع مشابه
Algebraic Matching of Vulnerabilities in a Low-Level Code
This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...
متن کاملMembership Conditional Term Rewriting Systems
We propose a new type of conditional term rewriting system: the membership-conditional term rewriting system, in which, each rewriting rule can have membership conditions which restrict the substitution values for the variables occurring in the rule. For example, the rule f(x, x, y) . g(x, y) if x ∈ T ′ yields the reduction f(M, M, N) → g(M, N) only when M is in the term set T ′. We study the c...
متن کاملOn the confluence of λ-calculus with conditional rewriting
The confluence of untyped λ-calculus with unconditional rewriting is now well understood. In this paper, we investigate the confluence of λ-calculus with conditional rewriting and provide general results in two directions. First, when conditional rules are algebraic. This extends results of Müller and Dougherty for unconditional rewriting. Two cases are considered, whether betareduction is allo...
متن کاملConditional Term Graph Rewriting
For eeciency reasons, term rewriting is usually implemented by graph rewriting. It is known that graph rewriting is a sound and complete implementation of (almost) orthogonal term rewriting systems; see BEG + 87]. In this paper, we extend the result to properly oriented orthogonal conditional systems with strict equality. In these systems extra variables are allowed in conditions and right-hand...
متن کاملConfluence of Conditional Term Rewrite Systems via Transformations
Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term rewrite systems. Recent results provide confluence criteria for conditional term rewrite systems via transformations, yet they are restricted to CTRSs with ...
متن کاملConditions in Reactive Systems and in Graph Rewriting
We introduce conditional reactive systems, by enriching the reactive systems of Leifer and Milner with application conditions. Furthermore we compare to the situation in graph rewriting where application conditions play a major role.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999